A Trust Based Fuzzy Algorithm for Congestion Control in Wireless Multimedia Sensor Networks (TFCC)

Network congestion has become a critical issue for resource constrained Wireless Sensor Networks (WSNs), especially for Wireless Multimedia Sensor Networks (WMSNs)where large volume of multimedia data is transmitted through the network. If the traffic load is greater than the available capacity of the sensor network, congestion occurs and it causes buffer overflow, packet drop, deterioration of network throughput and quality of service (QoS). Again, the faulty nodes of the network also aggravate congestion by diffusing useless packets or retransmitting the same packet several times. This results in the wastage of energy and decrease in network lifetime. To address this challenge, a new congestion control algorithm is proposed in which the faulty nodes are identified and blocked from data communication by using the concept of trust. The trust metric of all the nodes in the WMSN is derived by using a two-stage Fuzzy inferencing scheme. The traffic flow from source to sink is optimized by implementing the Link State Routing Protocol. The congestion of the sensor nodes is controlled by regulating the rate of traffic flow on the basis of the priority of the traffic. Finally we compare our protocol with other existing congestion control protocols to show the merit of the work.Comment: 6 pages, 5 figures, conference pape

A Trust Based Congestion Aware Hybrid Ant Colony Optimization Algorithm for Energy Efficient Routing in Wireless Sensor Networks (TC-ACO)

Congestion is a problem of paramount importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources. Sensor nodes are prone to failure and the misbehavior of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols. Unfortunately most of the researchers have tried to make the routing schemes energy efficient without considering congestion factor and the effect of the faulty nodes. In this paper we have proposed a congestion aware, energy efficient, routing approach that utilizes Ant Colony Optimization algorithm, in which faulty nodes are isolated by means of the concept of trust. The merits of the proposed scheme are verified through simulations where they are compared with other protocols.Comment: 6 pages, 5 figures and 2 tables (Conference Paper

Detailed particle-in-cell simulations on the transport of a relativistic electron beam in plasmas

We present comprehensive two-dimensional (2D) particle-in-cell (PIC) simulations on the transport of a relativistic electron beam in a plasma in the context of fast ignition fusion. The 2D PIC simulations are performed by constructing two different simulation planes and have shown the complete stabilization and destabilization of the Weibel instability due to the beam temperature and background plasma collisions, respectively. Some three-dimensional PIC simulation results on the filamentary structures are also shown thereby further shedding light on the filamentation of the electron beam in plasmas. The linear growth rates of fastest growing mode in the beam-plasma system are compared with a theoretical model developed and are found in good agreement with each other.DFGU. S. Department of Energy DEFG02-04ER41321 DE-FG02-04ER54763Alliance Program of the Helmholtz Association HA216/EMMIPhysic

Three dimensional filamentary structures of a relativistic electron beam in Fast Ignition plasmas

The filamentary structures and associated electromagnetic fields of a relativistic electron beam have been studied by three dimensional particle-in-cell (PIC) simulations in the context of Fast Ignition fusion. The simulations explicitly include collisions in return plasma current and distinctly examine the effects of beam temperature and collisions on the growth of filamentary structures generated.Comment: 4 pages, 6 figures, submitted to Physics of Plasma

Trust Integrated Congestion Aware Energy Efficient Routing forWireless Multimedia Sensor Networks (TCEER)

Congestion control and energy consumption in Wireless Multimedia Sensor Network is a new research subject which has been ushered in through the introduction of multimedia sensor nodes that are capable of transmitting large volume of high bit rate heterogeneous multimedia data. Most of the existing congestion control algorithms for Wireless Sensor Networks do not discuss the impact of security attacks by the malicious nodes in network congestion. Sensor nodes are prone to failure and malicious nodes aggravate congestion by sending fake messages. Hence, isolation of malicious nodes from data routing path reduces congestion significantly. Considering that, we have proposed a new Trust Integrated Congestion Aware Energy Efficient Routing algorithm, in which malicious nodes are identified using the concept of trust. The parameter Node Potential is computed, on the basis of the trust value, congestion status, residual energy and the distance of the node from the base station, using Fuzzy Logic Controller. The source node selects the node with the highest potential in its one hop radio range for data transmission which is light weight as well as energy efficient. Finally, merits of the proposed scheme are discussed by comparing them with existing protocols and the study exhibits 25% improvements in network performance

Three Input Exclusive-OR Gate Support For Boyar-Peralta\u27s Algorithm (Extended Version)

The linear layer, which is basically a binary non-singular matrix, is an integral part of cipher construction in a lot of private key ciphers. As a result, optimising the linear layer for device implementation has been an important research direction for about two decades. The Boyar-Peralta\u27s algorithm (SEA\u2710) is one such common algorithm, which offers significant improvement compared to the straightforward implementation. This algorithm only returns implementation with XOR2 gates, and is deterministic. Over the last couple of years, some improvements over this algorithm has been proposed, so as to make support for XOR3 gates as well as make it randomised. In this work, we take an already existing improvement (Tan and Peyrin, TCHES\u2720) that allows randomised execution and extend it to support three input XOR gates. This complements the other work done in this direction (Banik et al., IWSEC\u2719) that also supports XOR3 gates with randomised execution. Further, noting from another work (Maximov, Eprint\u2719), we include one additional tie-breaker condition in the original Boyar-Peralta\u27s algorithm. Our work thus collates and extends the state-of-the-art, at the same time offers a simpler interface. We show several results that improve from the lastly best-known results

A Novel Duplication Based Countermeasure To Statistical Ineffective Fault Analysis

The Statistical Ineffective Fault Analysis, SIFA, is a recent addition to the family of fault based cryptanalysis techniques. SIFA based attack is shown to be formidable and is able to bypass virtually all the conventional fault attack countermeasures. Reported countermeasures to SIFA incur overheads of the order of at least thrice the unprotected cipher. We propose a novel countermeasure that reduces the overhead (compared to all existing countermeasures) as we rely on a simple duplication based technique. In essence, our countermeasure eliminates the observation that enables the attacker to perform SIFA. The core idea we use here is to choose the encoding for the state bits randomly. In this way, each bit of the state is free from statistical bias, which renders SIFA unusable. Our approach protects against stuck-at faults and also does not rely on any side channel countermeasure. We show the effectiveness of the countermeasure through an open source gate-level fault attack simulation tool. Our approach is probably the simplest and the most cost effective